Cdmtcs Research Report Series the Hausdorr Measure of Regular !-languages Is Computable 1
نویسنده
چکیده
منابع مشابه
CDMTCS Research Report Series Hausdorff Measure and Łukasiewicz Languages
The paper investigates fixed points and attractors of infinite iterated function systems in Cantor space. By means of the theory of formal languages simple examples of the non-coincidence of fixed point and attractor (closure of the fixed point) are given.
متن کاملCdmtcs Research Report Series Eective Presentability of Boolean Algebras of Cantor{bendixson Rank 1 Eective Presentability of Boolean Algebras of Cantor{bendixson Rank 1
We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B=I is of Cantor{Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of in nite Cantor{Bendixson rank.
متن کاملCdmtcs Research Report Series Computable Kripke Models and Intermediate Logics
We introduce e ectiveness considerations into model theory of intuitionistic logic. We investigate e ectiveness of completeness (by Kripke) results for intermediate logics such as for example, intuitionistic logic, classical logic, constant domain logic, directed frames logic, Dummett's logic, etc.
متن کاملCDMTCS Research Report Series Physical Unknowables
Different types of physical unknowables are discussed. Provable unknowables are derived from reduction to problems which are known to be recursively unsolvable. Recent series solutions to the n-body problem and related to it, chaotic systems, may have no computable radius of convergence. Quantum unknowables include the random occurrence of single events, complementarity and value indefiniteness...
متن کاملA Tight Upper Bound on Kolmogorov
The present paper links the concepts of Kolmogorov complexity (in Complexity theory) and Hausdorr dimension (in Fractal geometry) for a class of recursive (computable) !-languages. It is shown that the complexity of an innnite string contained in a 2-deenable set of strings is upper bounded by the Hausdorr dimension of this set and that this upper bound is tight. Moreover, we show that there ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998